Ackermann’s Function in Iterative Form: A Proof Assistant Experiment

Ackermann's function can be expressed using an iterative algorithm, which essentially takes the form of a term rewriting system. Although termination this algorithm is far from obvious, its equivalence to traditional recursive formulation--and therefore totality--has simple proof in Isabelle/HOL. This small example formalising mathematics assistant, with focus on treatment difficult recursions.